Synthesis of 2-Commodity Flow Networks
نویسندگان
چکیده
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible solutions and using this characterization we reduce the size of the linear program. For 0/1 requirements we present a closed fractional optimal solution, a closed integer-capacities optimal solution, and 76 -approximation for the case in which integer 2-commodity flows are required.
منابع مشابه
Introducing Simplex Mass Balancing Method for Multi-commodity Flow Network with a Separator
Maximization of flow through the network has remained core issue in the field of optimization. In this paper a new advanced network problem is introduced, i.e., a multi-commodity network with a separator. This network consists of several sub-networks linked through a commodity separator. The objective is to maximize the flow of the commodity of interest from the commodity mixture at the output ...
متن کامل2-Commodity Integer Network Synthesis Problem
We consider the following 2-commodity, integer network synthesis problem: Given two n×n, non-negative, symmetric, integer-valued matrices R = (rij) and S = (sij) of minimum flow requirements of 2 different commodities, construct an undirected network G = [N,E, c] on node set N = {1, 2, . . . , n} with integer edge capacities {c(e) : e ∈ E}, such that: (i) for any two pairs (i, j) and (k, l), i ...
متن کاملTwelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems
Two special and important network flow problems are the maximal flow problem and the shortest path problem. Both of these problems can be solved by either the network simplex method of Chapter 9 or the out-of-kilter algorithm of Chapter 11. However, their frequent occurrence in practice and the specialized, more efficient procedures that can be developed for handling these two problems provide ...
متن کاملBrief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing
In the concurrent multi-commodity flow problem, we are given a capacitated network G = (V,E) of switches V connected by links E, and a set of commodities K = {(si, ti, di)}. The objective is to maximize the minimum fraction λ of any demand di that is routed from source si to target ti. This problem has been studied extensively by the theory community in the sequential model (e.g., [4]) and in d...
متن کاملOptimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
Network design problems arise in a wide range of applied areas including telecommunications, computer networks, and transportation. In this paper, we address the following discrete capacitated multi-terminal network design problem. Given a connected digraph G = (V,A), a set of L potential facilities to be installed on each arc, and a set ofKmulti-terminal (non-simultaneous) commodity flow requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001